On the regularity-preserving elements in regular LA** -semigroups
نویسندگان
چکیده
منابع مشابه
Regular Elements of Some Semigroups of Order-Preserving Partial Transformations
Let X be a chain, OP (X) the order-preserving partial transformation semigroup on X and OI(X) the order-preserving 1–1 partial transformation semigroup on X. It is known that both OP (X) and OI(X) are regular semigroups. We extend these results by characterizing the regular elements of the semigroups OP (X,Y ), OI(X,Y ), OP (X,Y ) and OI(X,Y ) where ∅ = Y ⊆ X,OP (X,Y ) = {α ∈ OP (X) | ranα ⊆ Y ...
متن کاملCongruences on Regular Semigroups
Let S be a regular semigroup and let p be a congruence relation on S. The kernel of p, in notation kerp, is the union of the idempotent p-classes. The trace of p, in notation trp, is the restriction of p to the set of idempotents of S. The pair (kerp,trp) is said to be the congruence pair associated with p. Congruence pairs can be characterized abstractly, and it turns out that a congruence is ...
متن کاملFlows on Regular Semigroups
We study the structure of the flow monoid of a regular semigroup. This arises from the approach of Nambooripad of considering a regular semigroup as a groupoid – a category in which every morphism is invertible. A flow is then a section to the source map in this groupoid, and the monoid structure of the set of all flows is determined in terms of the Green relations on the original semigroup.
متن کاملRegular ordered semigroups and intra-regular ordered semigroups in terms of fuzzy subsets
Let $S$ be an ordered semigroup. A fuzzy subset of $S$ is anarbitrary mapping from $S$ into $[0,1]$, where $[0,1]$ is theusual interval of real numbers. In this paper, the concept of fuzzygeneralized bi-ideals of an ordered semigroup $S$ is introduced.Regular ordered semigroups are characterized by means of fuzzy leftideals, fuzzy right ideals and fuzzy (generalized) bi-ideals.Finally, two m...
متن کاملOn Regularity-Preserving Functions
1 Some Homework Exercises In introductory automata theory, one can nd a wealth of entertaining automata-theoretic puzzles such as the classical rst halves problem: Show that if A is a regular set, then so is the set of all rst halves of strings in A: FirstHalves(A) = fx j 9y jyj = jxj and xy 2 Ag : Once students master the basic pebbling technique for solving such problems, they can move on to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Applied Science
سال: 2020
ISSN: 1513-7805
DOI: 10.14416/j.appsci.2020.02.006